Association Policy for XML Query Answering By Mining Tree
نویسندگان
چکیده
منابع مشابه
CoXML: Cooperative XML Query Answering?
As the World Wide Web becomes a major means in disseminating and sharing information, there has been an exponential increase in the amount of data in web-compliant format such as HyperText Markup Language (HTML) and Extensible Markup Language (XML). XML is essentially a textual representation of the hierarchical (tree-like) data where a meaningful piece of data is bounded by matching starting a...
متن کاملExtensible markup Language approximate query answering Using data mining, intentional based on Tree-Based Association Rules
With the increasing popularity of XML for data representations, there is a lot of interest in searching XML data. Due to the structural heterogeneity and textual content’s diversity of XML, it is daunting for users to formulate exact queries and search accurate answers. Therefore, approximate matching is introduced to deal with the difficulty in answering users’ queries, and this matching could...
متن کاملControl in XML PDMS Query Answering
Peer data management system (PDMS) is a decentralized system, in which each peer is autonomous and has its own schema and database. With the help of pairwise schema mapping built between any two relevant peers, a query at one peer can be rewritten and broadcast to the whole PDMS. Then answers from multiple peers are returned to the querying peer. In our thesis, we exploit the access control iss...
متن کاملCoXML: A Cooperative XML Query Answering System
The heterogeneity nature of XML data creates the need for approximate query answering. In this paper, we present an XML system that cooperates with users to provide user-specific approximate query answering. The key features of the system include: 1) a query language that allows users to specify approximate conditions and relaxation controls; 2) a relaxation index structure, XTAH, that enables ...
متن کاملMining XML Frequent Query Patterns
With XML being the standard for data encoding and exchange over Internet, how to find the interesting XML query characteristic efficiently becomes a critical issue. Mining frequent query pattern is a technique to discover the most frequently occurring query pattern trees from a large collection of XML queries. In this paper, we describe an efficient mining algorithm to discover the frequent que...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IJARCCE
سال: 2015
ISSN: 2278-1021
DOI: 10.17148/ijarcce.2015.43141